Cycle factors in dense graphs
نویسنده
چکیده
It is proven that a graph with n vertices and minimum degree at least h+2 2h n contains n h ? O(h 2) vertex disjoint cycles of size h, and that a graph with n > N(h) vertices and minimum degree at least h+3 2h n contains n h vertex disjoint h-cycles, provided h divides n. Bounds on the minimum degree required for G to contain a factor consisting of cycles of speciied lengths are also discussed. This work is motivated by a conjecture of El-Zahar 9].
منابع مشابه
0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملDESIGNING AN OPTIMIZATION MODEL FOR PREVENTING THE WASTE TIME IN THE ACTIVITY CYCLE OF AN ORGANIZATION
This article proposes an optimization model for preventing the waste of time in the educational and research activities' cycle of an organization such as a university. For this purpose and in order to increase efficiency and prevent the waste of time; the graph theory models have been used. The educational and research activities diagrams of a supposed university is drawn by the use of graphs t...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملOn the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
Dirac's classical theorem asserts that, if every vertex of a graph G on n vertices has degree at least n2 then G has a Hamiltonian cycle. We give a fast parallel algorithm on a CREW PRAM to nd a Hamiltonian cycle in such graphs. Our algorithm uses a linear number of processors and is optimal up to a polylogarithmic factor. The algorithm works in O(log4 n) parallel time and uses linear number of...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملINTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS
For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 197-198 شماره
صفحات -
تاریخ انتشار 1999